In this paper two R-L network simulator configurations employing a single VDDIBA, one resistance and one grounded capacitance are presented. The first configuration is a grounded series resistor-inductor (R-L) network simulator and the second configuration is intended for grounded parallel resister-inductor (R-L) circuit simulation. Both the proposed circuits enjoy several beneficial features such as: 1) compact structure employing only one VDDIBA and two passive elements, 2) electronic tuning of inductive part of realized series/parallel R-L impedances, 3) independent control of inductive and resistive parts of realized parallel R-L impedance, 4) no requirement of any component matching, and 5) un-deviated performance in non-ideal environment. By choosing appropriate values of Active/passive elements, a series R-L circuit for simulating resistance of 7. 742 kΩ and inductance of value 7. 742 mH has been developed. Similarly a parallel R-L simulation circuit to simulate a resistance of value 1 kΩ and inductance of value 77. 4 μ H is implemented. To study the influence of parasitics on developed lossy inductances, the behavior of these configurations has been studied keeping terminal parasitics of VDDIBAs under consideration. To check the performance and usefulness of the proposed configurations some second-order filtering circuits have been designed. To confirm the theoretical analysis, PSPICE Simulation results have been included.

After extreme events such as floods, thunderstorms, blizzards and hurricanes there will be devastating effects in the distribution Networks which may cause a partial or complete blackout. Then, the major concern for the system operators is to restore the maximum critical loads as soon as possible by available generation units. In order to solve this problem, this paper provides a restoration strategy by using Distributed Generations (DGs). In this strategy, first, the shortest paths between DGs and critical loads are identified. Then, the best paths are determined by using a decision-making method, named PROMOTHEE-II to achieve the goals. The uncertainties for the output power of DGs are also considered in different scenarios. The IEEE 123-node distribution network is used to show the performance of the suggested method. The simulation results clearly show the efficiency of the proposed strategy for critical loads restoration in distribution Networks.

This research targets the investigation of characteristics within the maximal product of two RL-graphs by scrutinizing particular types of RL-graphs. Our first step in this quest entails introducing RL-graph concepts, followed by defining what constitutes a strong RL-graph, further elucidated by a practical example. Subsequently, we lay out the connection between RL-graphs and their maximal products. In particular, a theorem establishes that two RL-graphs are regular if their maximal product maintains regularity, and a parallel rule applies to α-regular RL-graphs. Contrarily, the reverse is not inherently true, a claim supported by a specific example. Nonetheless, by incorporating an additional condition, we validate the converse. Lastly, we assert that two RL-graphs are connected only if their maximal product is also a connected RL-graph. In conclusion, the maximal product of two RL-graphs holds potential in modeling societal health metrics and road accident rates.

In this paper, we formulate the resource allocation problem for secure communications in a single cell OFDMA network where a base station wants to communicate to the users which are spread over its coverage area while an adversary is present in the network. In our model, we assume that the adversary s an Active attacker which is able to either eavesdrop on the information transmitted over the wireless link or jam the connection by sending an interference signal but is not able to both eavesdrop and jam at the same time. The attacker's aim is to choose between eavesdropping and jamming a subcarrier such that the secrecy rate over that subcarrier is minimized. Knowing this strategy, users should consider the minimum of secrecy data rate in both cases as their achievable secrecy rate over each subcarrier. We formulate our proposed resource allocation problem into an optimization problem whose objective is to maximize the total secrecy rate of all users over all subcarriers while it is required that the total transmit power of base station remains below a predefined threshold. To solve the proposed optimization problem, we use the dual Lagrange approach. Using simulations, we study the behavior and the efficiency of the proposed scheme.

In this paper, for eachlattice-valued map A®L with some properties, a ring representation A®RL is constructed. This representation is denoted byc which is an f-ring homomorphism and a Q-linear map, where its indexc, mentions to a lattice-valued map. We use the notation a dpqa= (a − p)+^ (q − a)+, where p, q Î Q and a Î A, that is nominated asinterval projection. To get a well-defined f-ring homomorphism tc, we need such concepts asbounded, continuous, and Q-compatible for c, which are defined and some related results are investigated. On the contrary, we present a cozero lattice-valued map c f: A®L for each f-ring homomorphism f: A®RL. It is proved that crc=cr and tcf=f, which they make a kind of correspondence relation between ring representations A®RL and the lattice-valued maps A®L, where the mapping cr: A®L is called a realizationof c. It is shown that tcr=tc and crr=cr.

One of the serious threats to cyberspace is the Bot Networks or Botnets. Bots are malicious software that acts as a network and allows hackers to remotely manage and control infected computer victims. Given the fact that DNS is one of the most common protocols in the network and is essential for the proper functioning of the network, it is very useful for monitoring, detecting and reducing the activity of the Botnets. DNS queries are sent in the early stages of the life cycle of each Botnet, so infected hosts are identified before any malicious activity is performed. Because the exchange of information in the network environment and the volume of information is very high, Storing and indexing this massive data requires a large database. By using the DNS traffic analysis, we try to identify the Botnets. We used the data generated from the network traffic and information of known Botnets with the Splunk platform to conduct data analysis to quickly identify attacks and predict potential dangers that could arise. The analysis results were used in tests conducted on real network environments to determine the types of attacks. Visual IP mapping was then used to determine actions that could be taken. The proposed method is capable of recognizing known and unknown Bots.

It is well known that the sum of two z-ideals in C(X) is either C(X) or a z-ideal. The main aim of this paper is to study the sum of strongly z-ideals in RL, the ring of real-valued continuous functions on a frame L. For every ideal I in RL, we introduce the biggest strongly z-ideal included in I and the smallest strongly z-ideal containing I, denoted by Isz and Isz, respectively. We study some properties of Isz and Isz: Also, it is observed that the sum of any family of minimal prime ideals in the ring RL is either RL or a prime strongly z-ideal in RL. In particular, we show that the sum of two prime ideals in RL which are not chains is a prime strongly z-ideal.